Efficient Querying on Genomic Databases by Using Metric Space Indexing Technology

نویسندگان

  • Weimin Chen
  • Karl Aberer
چکیده

The " Arbeitspapiere der GMD – GMD Technical Reports " primarily comprise preliminary publications , specific partial results and complementary material. In the interest of a subsequent final publication the " Arbeitspapiere/Technical Reports " should not be copied. Critical comments would be appreciated by the authors. No part of this publication may be reproduced or further processed in any form or by any means without the prior permission of GMD. All rights reserved. Abstract. A genomic database consists of a set of nucleotide sequences, for which an important kind of queries is the local sequence alignment. This paper studies the indexing techniques to support fast query evaluation for local alignment, by transforming the alignment problem to a variant metric space neighborhood search problem. We propose and analyze the corresponding algorithms and structures, and identify several directions for the future work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Querying on Genomic Databases by Using Metric Space Indexing Techniques

A genomic database consists of a set of nucleotide sequences, for which an important kind of queries is the local sequence alignment. This paper investigates two different indexing techniques, namely the variations of GNAT trees [1] and M-trees [3], to support fast query evaluation for local alignment, by transforming the alignment problem to a variant metric space neighborhood search problem.

متن کامل

Efficient Querying on Gnomic Databases by Using Metric Space Indexing Techniques

A genomic database consists of a set of nucleotide sequences, for which an important kind of queries is the local sequence alignment. This paper investigates two different indexing techniques, namely the variations of GNAT trees [1] and M-trees [3], to support fast query evaluation for local alignment, by transforming the alignment problem to a variant metric space neighborhood search problem.

متن کامل

Universal Indexing of Arbitrary Similarity Models

The increasing amount of available unstructured content together with the growing number of large non-relational databases put more emphasis on the content-based retrieval and precisely on the area of similarity searching. Although there exist several indexing methods for efficient querying, not all of them are best-suited for arbitrary similarity models. Having a metric space, we can easily ap...

متن کامل

Recursive partitioning method for trajectory indexing

A trajectory is defined as the record of time-varying spatial phenomenon. The trajectory database is an important research area that has received a lot of interest in the last decade, with the objective of trajectory databases being to extend existing database technology to support the representation and querying of moving objects and their trajectories. Querying in trajectory databases can be ...

متن کامل

Optimal Embedding for Shape Indexing in Medical Image Databases

Fast retrieval using organ shapes is crucial in medical image databases since shape is a clinically prominent feature. In this paper, we propose that 2-D shapes in medical image databases can be indexed by embedding them into a vector space and using efficient vector space indexing. An optimal shape space embedding is proposed for this purpose. Experimental results of indexing vertebral shapes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997